Cryptanalysis of the Alleged SecurID Hash Function
Identifieur interne : 001552 ( Main/Exploration ); précédent : 001551; suivant : 001553Cryptanalysis of the Alleged SecurID Hash Function
Auteurs : Alex Biryukov [Belgique] ; Joseph Lano [Belgique] ; Bart Preneel [Belgique]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2004.
Abstract
Abstract: The SecurID hash function is used for authenticating users to a corporate computer infrastructure. We analyse an alleged implementation of this hash function. The block cipher at the heart of the function can be broken in few milliseconds on a PC with 70 adaptively chosen plaintexts. The 64-bit secret key of 10% of the cards can be discovered given two months of token outputs and 248 analysis steps. A larger fraction of cards can be covered given more observation time.
Url:
DOI: 10.1007/978-3-540-24654-1_10
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003337
- to stream Istex, to step Curation: 003084
- to stream Istex, to step Checkpoint: 000D87
- to stream Main, to step Merge: 001603
- to stream Main, to step Curation: 001552
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Cryptanalysis of the Alleged SecurID Hash Function</title><author><name sortKey="Biryukov, Alex" sort="Biryukov, Alex" uniqKey="Biryukov A" first="Alex" last="Biryukov">Alex Biryukov</name></author><author><name sortKey="Lano, Joseph" sort="Lano, Joseph" uniqKey="Lano J" first="Joseph" last="Lano">Joseph Lano</name></author><author><name sortKey="Preneel, Bart" sort="Preneel, Bart" uniqKey="Preneel B" first="Bart" last="Preneel">Bart Preneel</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C66A7B20A96DBB93B7EFC995B84154A6154F5B18</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1007/978-3-540-24654-1_10</idno><idno type="url">https://api.istex.fr/document/C66A7B20A96DBB93B7EFC995B84154A6154F5B18/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">003337</idno><idno type="wicri:Area/Istex/Curation">003084</idno><idno type="wicri:Area/Istex/Checkpoint">000D87</idno><idno type="wicri:doubleKey">0302-9743:2004:Biryukov A:cryptanalysis:of:the</idno><idno type="wicri:Area/Main/Merge">001603</idno><idno type="wicri:Area/Main/Curation">001552</idno><idno type="wicri:Area/Main/Exploration">001552</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Cryptanalysis of the Alleged SecurID Hash Function</title><author><name sortKey="Biryukov, Alex" sort="Biryukov, Alex" uniqKey="Biryukov A" first="Alex" last="Biryukov">Alex Biryukov</name><affiliation wicri:level="1"><country xml:lang="fr">Belgique</country><wicri:regionArea>Dept. Elect. Eng.-ESAT/SCD-COSIC, Katholieke Universiteit Leuven, Kasteelpark Arenberg 10, B-3001, Leuven-Heverlee</wicri:regionArea><wicri:noRegion>Leuven-Heverlee</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Belgique</country></affiliation></author><author><name sortKey="Lano, Joseph" sort="Lano, Joseph" uniqKey="Lano J" first="Joseph" last="Lano">Joseph Lano</name><affiliation wicri:level="1"><country xml:lang="fr">Belgique</country><wicri:regionArea>Dept. Elect. Eng.-ESAT/SCD-COSIC, Katholieke Universiteit Leuven, Kasteelpark Arenberg 10, B-3001, Leuven-Heverlee</wicri:regionArea><wicri:noRegion>Leuven-Heverlee</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Belgique</country></affiliation></author><author><name sortKey="Preneel, Bart" sort="Preneel, Bart" uniqKey="Preneel B" first="Bart" last="Preneel">Bart Preneel</name><affiliation wicri:level="1"><country xml:lang="fr">Belgique</country><wicri:regionArea>Dept. Elect. Eng.-ESAT/SCD-COSIC, Katholieke Universiteit Leuven, Kasteelpark Arenberg 10, B-3001, Leuven-Heverlee</wicri:regionArea><wicri:noRegion>Leuven-Heverlee</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Belgique</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2004</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">C66A7B20A96DBB93B7EFC995B84154A6154F5B18</idno><idno type="DOI">10.1007/978-3-540-24654-1_10</idno><idno type="ChapterID">10</idno><idno type="ChapterID">Chap10</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The SecurID hash function is used for authenticating users to a corporate computer infrastructure. We analyse an alleged implementation of this hash function. The block cipher at the heart of the function can be broken in few milliseconds on a PC with 70 adaptively chosen plaintexts. The 64-bit secret key of 10% of the cards can be discovered given two months of token outputs and 248 analysis steps. A larger fraction of cards can be covered given more observation time.</div></front></TEI><affiliations><list><country><li>Belgique</li></country></list><tree><country name="Belgique"><noRegion><name sortKey="Biryukov, Alex" sort="Biryukov, Alex" uniqKey="Biryukov A" first="Alex" last="Biryukov">Alex Biryukov</name></noRegion><name sortKey="Biryukov, Alex" sort="Biryukov, Alex" uniqKey="Biryukov A" first="Alex" last="Biryukov">Alex Biryukov</name><name sortKey="Lano, Joseph" sort="Lano, Joseph" uniqKey="Lano J" first="Joseph" last="Lano">Joseph Lano</name><name sortKey="Lano, Joseph" sort="Lano, Joseph" uniqKey="Lano J" first="Joseph" last="Lano">Joseph Lano</name><name sortKey="Preneel, Bart" sort="Preneel, Bart" uniqKey="Preneel B" first="Bart" last="Preneel">Bart Preneel</name><name sortKey="Preneel, Bart" sort="Preneel, Bart" uniqKey="Preneel B" first="Bart" last="Preneel">Bart Preneel</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001552 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001552 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:C66A7B20A96DBB93B7EFC995B84154A6154F5B18
|texte= Cryptanalysis of the Alleged SecurID Hash Function
}}
| This area was generated with Dilib version V0.6.32. |  |